Section: New Results

Formal Security Proof in EasyCrypt: case studies and extensions

Participants : Cécile Baritel-Ruet, Benjamin Grégoire.

We completed a formal proof of security for CMAC, a scheme for cipher-based message authentication code. A publication is being submitted on this topic. We also experimented on a formal study of the forking lemma, which is present in many security proofs for signing schemes that rely on lattice problems.

The lessons derived from these experiments lead us to proposing new tools for matching instructions and unifying formulas with meta-variables in EasyCrypt.